Short Message Noisy Network Coding With a Decode-Forward Option

نویسندگان

  • Jie Hou
  • Gerhard Kramer
چکیده

Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies that unify the advantages of decode-forward and noisy network coding. Third, the best decoders sometimes treat other nodes’ signals as noise and an iterative method is given to find the set of nodes that a given node should treat as noise sources.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rateless Coding over Wireless Relay Networks Using Amplify/Decode and Forward Relays

In this paper two different rateless transmissionschemes are developed. In the proposed scheme, relay node candecode and forward the message to the destination if they areable to decode it, or amplify and forward the message to thedestination. Based on the analysis and simulation resultsprovided in this paper, the proposed method has bettertransmission time than the scheme which only the relay ...

متن کامل

Short Message Noisy Network Coding with Rate Splitting

For noisy network with multiple relays, short message noisy network coding with rate splitting (SNNC-RS) scheme is presented. It has recently been shown by Hou and Kramer that mixed cooperative strategies in which relays in favorable positions decode-and-forward (DF) and the rest quantize via short message noisy network coding (SNNC) can outperform existing cooperative strategies (e.g., noisy n...

متن کامل

Coding for Relay Networks and Effective Secrecy for Wire-tap Channels

This thesis addresses two problems of network information theory: coding for relay networks and (accurate) approximations of distributions based on unnormalized informational divergence with applications to network security. For the former problem, we first consider short message noisy network coding (SNNC). SNNC differs from long message noisy network coding (LNNC) in that one transmits many s...

متن کامل

Achievable rates for relay networks using superposition coding

We investigate the superposition strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally believed that the superposition can out perform decode-forward or compress-forwar...

متن کامل

Ieee Information Theory Society Newsletter President's Column from the Editor It Society Member Honored Scholar One Website for Ieee Transactions on Information Theory Has Gone Live Throughput and Capacity Regions Coding for Noisy Networks

Network information theory aims to establish the limits on information fl ow in noisy networks and the coding schemes that achieve these limits. Although a general theory is yet to be developed, several coding schemes and bounds on the capacity have been developed. This article reviews these results with emphasis on two recently developed coding schemes—noisy network coding and compute–forward....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 62  شماره 

صفحات  -

تاریخ انتشار 2016